Termination Proof Script

Consider the TRS R consisting of the rewrite rule
1:    f(0,1,x)  → f(x,x,x)
There is one dependency pair:
2:    F(0,1,x)  → F(x,x,x)
The approximated dependency graph contains no SCCs and hence the TRS is trivially terminating.
Tyrolean Termination Tool  (0.01 seconds)   ---  May 3, 2006